Block Network Error Control Codes and Syndrome-based Complete Maximum Likelihood Decoding
نویسندگان
چکیده
In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the scheme to correct a mixture of symbol errors and packet erasures and to detect symbol errors is studied. The idea of syndrome-based decoding and error detection is introduced for BNEC, which removes the effect of input data and hence decreases the complexity. Next, an efficient three-stage syndrome-based BNEC decoding scheme for network error correction is proposed, in which prior to finding the error values, the position of the edge errors are identified based on the error spaces at the receivers. In addition to bounded-distance decoding schemes for error correction up to the refined Singleton bound, a complete decoding scheme for BNEC is also introduced. Specifically, it is shown that using the proposed syndrome-based complete decoding, a network error correcting code with redundancy order δ t for receiver t, can correct δ t-1 random additive errors with a probability sufficiently close to 1, if the field size is sufficiently large. Also, a complete maximum likelihood decoding scheme for BNEC is proposed. As the probability of error in different network edges is not equal in general, and given the equivalency of certain edge errors within the network at a particular receiver, the number of edge errors, assessed in the refined Singleton bound, is not a sufficient statistic for ML decoding. I. INTRODUCTION The joint design of network and channel codes is an enabling technique for robust and efficient communications over networks with imperfect links. In this paradigm, this article deals with the design of block network error control codes and syndrome-based error correction and detection in a directed acyclic network. More specifically, we consider the scenario in which the network is subject to a mixture of additive random symbol errors and packet erasures with possibly different probabilities in different links.
منابع مشابه
Study of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis
In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated ...
متن کاملNeural networks, error-correcting codes, and polynomials over the binary n -cube
-Several ways of relating the concept of error-correcting codes to the concept of neural networks are presented. Performing maximum likelihood decoding in a linear block error-correcting code is shown to be equivalent to finding a global maximum of the energy function of a certain neural network. Given a linear block code, a neural network can be constructed in such a way that every local maxim...
متن کاملMaximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MMI) on space-time block codes that enable symbolwise maximum likelihood decoding for a frequency non-selective quasi-static fading channel. MMI is an upper bound on how much one can send information with vanishing error...
متن کاملA New Treatment of Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes
In this correspondence we present a new method to convert the maximum-likelihood soft-decision decoding problem for linear block codes into a graph search problem where generalized Dijkstra’s algorithm can still be applied to the decoding procedure. The cost assigned to every branch in the graph is based on a generalization of Wagner rule which is an equivalent form of the maximum-likelihood de...
متن کاملFast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0809.4149 شماره
صفحات -
تاریخ انتشار 2008